Coalition Formation Games for Dynamic Multirobot Tasks

نویسندگان

  • Halûk Bayram
  • H. Isil Bozma
چکیده

This paper studies the problem of forming coalitions for dynamic tasks in multirobot systems. As robots either individually or in groups – encounter new tasks for which individual or group resources do not suffice, robot coalitions that are collectively capable of meeting these requirements need to be formed. We propose an approach where such tasks are reported to a task coordinator that is responsible for coalition formation. The novelty of this approach is that the process of determining these coalitions is modeled as a coalition formation game where groups of robots are evaluated with respect to resources and cost. As such, the resulting coalitions are ensured that no group of robots has a viable alternative to staying within their assigned coalition. The newly determined coalitions are then conveyed to the robots which then form the coalitions as instructed. As new tasks are encountered, coalitions merge and split so that the resulting coalitions are capable of the newly encountered tasks. Extensive simulations demonstrate the effectiveness of the proposed approach in a wide range of tasks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coalition Formation: From Software Agents to Robots

A problem that has recently attracted the attention of the research community is the autonomous formation of robot teams to perform complex multirobot tasks. The corresponding problem for software agents is also known in the multi-agent community as the coalition formation problem. Numerous algorithms for software agent coalition formation have been provided that allow for efficient cooperation...

متن کامل

A Framework for Multi-Robot Coalition Formation

Task allocation is a fundamental problem that any multirobot system must address. Numerous multi-robot task allocation schemes have been proposed over the past decade. A vast majority of these schemes address the problem of assigning a single robot to each task. However as the complexity of multi-robot tasks increases, often situations arise where multiple robot teams need to be assigned to a s...

متن کامل

Hedonic Coalition Formation in Networks

Coalition formation is a fundamental problem in the organization of many multi-agent systems. In large populations, the formation of coalitions is often restricted by structural visibility and locality constraints under which agents can reorganize. We capture and study this aspect using a novel network-based model for dynamic locality within the popular framework of hedonic coalition formation ...

متن کامل

DCF-S: A Dynamic Coalition Formation Scheme for Rational Agents

We introduce the notion, issues, and challenges of dynamic coalition formation (DCF) among agents in open, heterogeneous and world widely distributed environments. Results achieved in the traditional field of static coalition formation are briefly discussed, as well as the desired results in the new research field of DCF. We propose a simulation-based DCF scheme, called DCF-S, to be applied to ...

متن کامل

Overlapping coalition formation games: charting the tractability frontier

Cooperative games with overlapping coalitions (OCF games) [3, 23] model scenarios where agents can distribute their resources among several tasks; each task generates a profit which may be freely divided among the agents participating in the task. The goal of this work is to initiate a systematic investigation of algorithmic aspects of OCF games. We propose a discretized model of overlapping co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Robotics Res.

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2014